منابع مشابه
Reset Sequences for Monotonic Automata
Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata. He gave algorithms that in polynomial time either find such sequences or prove that no such sequence exists. In this paper we present a new algorithm based on breadth first search that runs in faster asymptotic time than Natarajan...
متن کاملOn the Minimal Reset Words of Synchronizing Automata
Cerny’s conjecture is a 50 year old conjecture which concerns the combinatoral field of synchronizing automata. In particular, it postulates that the maximal length of the minimal reset word among all n-state automata is (n − 1). We present a proof for Pin’s Theorem, which applies Cerny’s conjecture to p-state automata consisting of a cycle and a nonpermutation, where p ≥ 3 is an odd prime. We ...
متن کاملAdding Dense-Timed Stack to Integer Reset Timed Automata
Integer reset timed automata (IRTA) are known to be a determinizable subclass of timed automata, but it is not known whether they are input-determined, i.e., the clock values are completely determined by an input timed word. We first define a syntactic subclass of IRTA called strict IRTA and show that strict IRTA is equivalent to IRTA. We show that the class of strict IRTA is indeed input-deter...
متن کاملThe Complexity of Finding Reset Words in Finite Automata
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish member...
متن کاملTwo Novel D-Flip Flops with Level Triggered Reset in Quantum Dot Cellular Automata Technology
Quantum dot cellular automata (QCA) introduces a pioneer technology in nano scale computer architectures. Employing this technology is one of the solutions to decrease the size of circuits and reducing power dissipation. In this paper, two new optimized FlipFlops with reset input are proposed in quantum dot cellular automata technology. In addition, comparison with related works is performed.Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1976
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(76)90466-6